The Well-Separated Pair Decomposition and Its Applications
نویسنده
چکیده
Computational geometry is concerned with the design and analysis of algorithms that solve problems on geometric data in R, where the dimension d is a constant. A large part of the field has been devoted to problems that involve distances determined by pairs of points in a given point set. Given a set S of n points in R, we may wish to compute a pair p, q of distinct points in S whose distance is minimum, the k smallest distances among the ( n 2 ) pairwise distances, the nearest neighbor of each point of S, or the minimum spanning tree of S. Most problems of this type can be rephrased as a graph problem on the complete Euclidean graph on S, in which each edge pq has a weight being the Euclidean distance |pq| between p and q. Since the number of edges in this graph is Θ(n), many problems involving pairwise distances can trivially be solved in O(n) time. Even though the complete Euclidean graph has size Θ(n), it can be represented in Θ(n) space: It is clearly sufficient to only store the points of S, because the weight of any edge can be computed in O(1) time. This leads to the question whether distance problems can be solved in subquadratic time, possibly at the cost of obtaining an approximate solution. For many of these problems, subquadratic algorithms have indeed been designed; see for example the books by Preparata and Shamos [21] and de Berg et al. [11], and the survey papers by Bern and Eppstein [5], Eppstein [12], and
منابع مشابه
Optimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition (Preliminary Version)
We present an optimal parallel algorithm to construct the well-separated pair decomposition of a point set P in < d. We show how this leads to a deterministic optimal O(logn) time parallel algorithm for nding the k-nearest-neighbors of each point in P, where k is a constant. We discuss several additional applications of the well-separated pair decomposition for which we can derive faster parall...
متن کاملINDEX TERMS: none.
Well-separated pair decomposition, introduced by Callahan and Kosaraju [3], has found numerous applications in solving proximity problems for points in the Euclidean space. A pair of point sets (A, B) is c-well-separated if the distance between A,B is at least c times the diameters of both A and B. A well-separated pair decomposition of a point set consists of a set of well-separated pairs that...
متن کاملOptimal Parallel All-Nearest-Neighbors Using the Well-Separated Pair Decomposition
W e present an optimal parallel algorithm t o construct the well-separated pair decomposition of a point set P in Zd. W e show how this leads to a deterministic opt imal O(1ogn) t ime parallel algorithm for finding the k nearest neighbors of each point in P, where k is a constant. W e discuss several additional applications of the well-separated pair decomposition for which we can derive fas t ...
متن کاملI/O-Efficient Well-Separated Pair Decomposition and its Applications
We present an external memory algorithm to compute a well-separated pair decomposition (WSPD) of a given point set P in d in O sort N I/Os using O N B blocks of external memory, where N is the number of points in P, and sort N denotes the I/O complexity of sorting N items. (Throughout this paper we assume that the dimension d is fixed). We also show how to dynamically maintain the WSPD in O log...
متن کاملI/O-Efficient Well-Separated Pair Decomposition
We present an external-memory algorithm to compute a well-separated pair decomposition (WSPD) of a given point set S in Rd in O(sort(N)) I/Os, where N is the number of points in S and sort(N) denotes the I/O-complexity of sorting N items. (Throughout this paper, we assume that the dimension d is fixed). As applications of the WSPD, we show how to compute a linear-size t-spanner for S within the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007